Periodicity in Quasipolynomial Convolution

نویسنده

  • Thomas Zaslavsky
چکیده

The leading term of a convolution of quasipolynomials with periods p and q is periodic with period gcd(p, q), smaller than expected. The degree of the convolution is usually d+e+1; we characterize the exceptions. To do this we need to characterize the null space of a circulant matrix. We wish to point out a simple yet unexpected property of quasipolynomial calculus. A quasipolynomial is a function of positive integers that is given by a cyclically repeating sequence of polynomials; that is,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A q-QUEENS PROBLEM III. PARTIAL QUEENS

Parts I and II showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n in which the coefficients are essentially polynomials in q. We explore this function for partial queens, which are pieces like the rook and bishop whose moves are a subset of those of the queen. We compute the five highest-order coe...

متن کامل

A q-QUEENS PROBLEM III. PARTIAL QUEENS

Parts I and II showed that the number of ways to place q nonattacking queens or similar chess pieces on an n× n square chessboard is a quasipolynomial function of n in which the coefficients are essentially polynomials in q. We explore this function for partial queens, which are pieces like the rook and bishop whose moves are a subset of those of the queen. We compute the five highest-order coe...

متن کامل

Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications

We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask [CS10], whose almost-periodicity lemma has had far-reaching implications in additive combinatorics. We provide an alternative (and L-norm free) point of view, which allows for proofs to easily be converted to probabilistic algorithms that decide membersh...

متن کامل

Dual periodicity in l1-norm minimisation problems

The topic of this paper is the discrete-time l1-norm minimisation problem with convolution constraints. We find primal initial conditions for which the dual optimal solution is periodic. Periodicity of the dual optimal solution implies satisfaction of a simple linear recurrence relation by the primal optimal solution. c © 2007 Elsevier B.V. All rights reserved.

متن کامل

Lecture 20: Discrete Fourier Transform and FFT

basically saying we care not about the rest of x[n], since it is zero. Pretend that it is periodic for analysis purpose since for the DFT it makes no difference. Defined only for 0≤ n,k ≤ N−1. The rest is zero. This means the inherent periodicity is not represented. Notation x[n] DFT ←→ X [k] Lots of properties (similar to DFS) circular convolution is important. Given x1[n] and x2[n], form x̃1[n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2004